Analyticity and polynomial approximation in modular function spaces

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

Polynomial Approximation of Functions in Sobolev Spaces

Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hubert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer o...

متن کامل

Nonlinear piecewise polynomial approximation beyond Besov spaces

We study nonlinear n-term approximation in Lp(R) (0 < p <∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R2 which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness spaces generated by multilevel nested triangulations. We call them B-spaces because they...

متن کامل

Fixed Point Theory in Modular Function Spaces

The author would like to thank Colegio El Pinar for their hospitality during the preparation of this survey.

متن کامل

On function spaces and polynomial-time computability

In Computable Analysis, elements of uncountable spaces, such as the real line R, are represented by functions on strings and fed to Turing machines as oracles; or equivalently, they are represented by infinite strings and written on the tapes of Turing machines [Wei00, BHW08]. To obtain reasonable notions of computability and complexity, it is hence important to choose the “right” representatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1989

ISSN: 0021-9045

DOI: 10.1016/0021-9045(89)90004-x